A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern
نویسندگان
چکیده
منابع مشابه
A linear-time algorithm for finding a complete graph minor in a dense graph
Let g(t) be the minimum number such that every graph G with average degree d(G) ≥ g(t) contains a Kt-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) ∈ Θ(t√log t). This article shows that for all fixed ǫ > 0 and fixed sufficiently large t ≥ t(ǫ), if d(G) ≥ (2 + ǫ)g(t) then we can find this Kt-minor in linear time. This...
متن کاملA Polynomial Time Algorithm for Graph Isomorphism
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
متن کاملA Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages
A tree pattern is a structured pattern known as a term in formal logic, and a tree pattern language is the set of trees which are the ground instances of a tree pattern. In this paper, we deal with the class of tree languages whose language is de ned as a union of at most k tree pattern languages, where k is an arbitrary xed positive number. In particular, we present a polynomial time algorithm...
متن کاملA Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
A rectangular layout L is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent VLSI chip layouts. More recently, they are used in graph drawing as rectangular cartograms. In these applications, an area a(r) is assigned to each rectangle r, and the act...
متن کاملFinding a Simple Polytope from Its Graph in Polynomial Time
We show that one can compute the combinatorial facets of a simple polytope from its graph in polynomial time. Our proof relies on a primal-dual characterization (by Joswig, Kaibel and Korner) and a linear program, with an exponential number of constraints, which can be used to construct the solution and can be solved in polynomial time. We show that this allows one to characterize the face latt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.120